Search results for " probabilistic reasoning"

showing 4 items of 4 documents

On the checking of g-coherence of conditional probability bounds

2003

We illustrate an approach to uncertain knowledge based on lower conditional probability bounds. We exploit the coherence principle of de Finetti and a related notion of generalized coherence (g-coherence), which is equivalent to the "avoiding uniform loss" property introduced by Walley for lower and upper probabilities. Based on the additive structure of random gains, we define suitable notions of non relevant gains and of basic sets of variables. Exploiting them, the linear systems in our algorithms can work with reduced sets of variables and/or constraints. In this paper, we illustrate the notions of non relevant gain and of basic set by examining several cases of imprecise assessments d…

Mathematical optimizationSettore MAT/06 - Probabilita' E Statistica MatematicaPosterior probabilityConditional probability tablealgorithmslower conditional probability boundRegular conditional probabilityalgorithms; generalized coherence; linear systems; lower conditional probability bounds; probabilistic reasoning; reduced sets of variables and constraints.Artificial Intelligencelinear systemprobabilistic reasoninggeneralized coherenceMathematicsDiscrete mathematicsreduced sets of variables and constraintsalgorithmlinear systemsProbabilistic logicLaw of total probabilityConditional probabilityCoherence (philosophical gambling strategy)Conditional probability distributionControl and Systems Engineeringlower conditional probability boundsSoftwareInformation Systems
researchProduct

Probabilistic Anomaly Detection for Wireless Sensor Networks

2011

Wireless Sensor Networks (WSN) are increasingly gaining popularity as a tool for environmental monitoring, however ensuring the reliability of their operation is not trivial, and faulty sensors are not uncommon; moreover, the deployment environment may influence the correct functioning of a sensor node, which might thus be mistakenly classified as damaged. In this paper we propose a probabilistic algorithm to detect a faulty node considering its sensed data, and the surrounding environmental conditions. The algorithm was tested with a real dataset acquired in a work environment, characterized by the presence of actuators that also affect the actual trend of the monitored physical quantities.

Settore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniKey distribution in wireless sensor networksBrooks–Iyengar algorithmComputer scienceNode (networking)Sensor nodeReal-time computingProbabilistic logicintelligent data analysis probabilistic reasoning wireless sensor networksAnomaly detectionWireless sensor network
researchProduct

Logical Operations among Conditional Events: theoretical aspects and applications

2019

We generalize the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. These notions are defined, in the setting of coherence, by means of suitable conditional random quantities with values in the interval $[0,1]$. We also define the notion of negation, by verifying De Morgan's Laws. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals and we show that some well known properties which are satisfied by conjunctions and disjunctions of unconditional events are also satisfied by conjunctions and disjunction of conditional events. We also examine in detail the coherence of the prevision a…

Settore MAT/06 - Probabilita' E Statistica MatematicaConditional events conditional random quantities conjunction disjunction negation coherent prevision assessments coherent extensions quasi conjunction probabilistic reasoning p-entailment inference rules iterated conditionals System P.
researchProduct

Algorithms for coherence checking and propagation of conditional probability bounds

2001

In this paper, we propose some algorithms for the checking of generalized coherence (g-coherence) and for the extension of imprecise conditional probability assessments. Our concept of g-coherence is a generalization of de Finetti’s coherence principle and is equivalent to the ”avoiding uniform loss” property for lower and upper probabilities (a la Walley). By our algorithms we can check the g-coherence of a given imprecise assessment and we can correct it in order to obtain the associated coherent assessment (in the sense of Walley and Williams). Exploiting some properties of the random gain we show how, in the linear systems involved in our algorithms, we can work with a reduced set of va…

reduced sets of variables and constraintsSettore MAT/06 - Probabilita' E Statistica MatematicaUncertain knowledgeUncertain knowledge probabilistic reasoning under coherence imprecise conditional probability assessments g-coherence checking g-coherent extension algorithms computational aspects reduced sets of variables reduced sets of linear constraints.g-coherent extensionimprecise conditional probability assessmentsg-coherence checkingUncertain knowledge; probabilistic reasoning under coherence; imprecise conditional probability assessments; g-coherence checking; g-coherent extension; algorithms.; computational aspects; reduced sets of variables and constraints.algorithmsprobabilistic reasoning under coherencecomputational aspects
researchProduct